IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
نویسندگان
چکیده
منابع مشابه
Sorting and Selecting in Totally Monotone
An mn matrix A is called totally monotone if for all i1 < i2 and j1 < j2, Ai1; j1] > Ai1; j2] implies Ai2; j1] > Ai2; j2]. We consider the complexity of comparison-based selection and sorting algorithms in such matrices. Although our selection algorithm counts only comparisons its advantage on all previous work is that it can also handle selection of elements of diierent (and arbitrary) ranks i...
متن کاملTotally Monotone Core and Products of Monotone Measures
Several approaches to the product of non-additive monotone measures (or capacities) are discussed and a new approach is proposed. It starts with the M obius product [E. Hendon, H.J. Jacobsen, B. Sloth, T. Tranñs, The product of capacities and belief functions, Mathematical Social Sciences 32 (1996) 95±108] of totally monotone measures and extends it by means of a supremum to general monotone m...
متن کاملMore Efficient Parallel Totally Monotone Matrix Searching
We give a parallel algorithm for computing all row minima in a totally monotone n = n matrix which is simpler and more work efficient than previous polylog-time Ž . Ž . algorithms. It runs in O lg n lg lg n time doing O n lg n work on a CRCW ' 2 Ž Ž . . Ž . PRAM, in O lg n lg lg n time doing O n lg n work on a CREW PRAM, and in ' Ž . Ž . O lg n lg n lg lg n time doing O n lg n lg lg n work on a...
متن کاملSearching monotone multi-dimensional arrays
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks’ search algorithm [2] for monotone 3-dimensional arrays to d-dimensions with d ≥ 4. Our new search algorithm is asymptotically optimal for d = 4.
متن کاملMonotone Confounding, Monotone Treatment Selection and Monotone Treatment Response.
Manski (1997) and Manski and Pepper (2000) gave sharp bounds on causal effects under the assumptions of monotone treatment response (MTR) and monotone treatment selection (MTS). VanderWeele (2008) provided bounds for binary treatment under an assumption of monotone confounding (MC). We discuss the relation between MC and MTS and provide bounds under various combinations of these assumptions. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 1993
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195993000087